Physical Node 1 VAS Memory Swap Persistent Swap Persistent

نویسندگان

  • John A. Mathew
  • Ken E. Barker
چکیده

In large persistent object systems it is possible to have many million (or eventually billion or more) objects in existence. These objects must be managed to enable their eeective and convenient use. At the heart of this management problem is the structure which maintains information about the objects and provides services on the objects using the information it maintains. We refer to this structure as a directory of objects. In a transparently distributed object system the directory must contain entries for all objects in the system regardless of their location. To ensure both eeciency and reliability any implementation of a global directory of objects (GDO) must be done carefully. This paper details the design of a GDO for a fully distributed persistent object system that is currently being built in a single shared address space. The design of the directory ooers eecient, scalable, and reliable services across a distributed environment. Further, although it is designed for a speciic (and somewhat unusual) environment, the implementation ideas are applicable to other distributed object systems. 1 Introduction This paper addresses the issue of managing large collections of persistent objects in a distributed environment. It does this by focusing on the key data structure required for object management, the object directory. Logically a single, global directory of objects (GDO) is desired but this is not a practical implementation strategy. Instead, a carefully distributed data structure is required that provides reliable, eecient, and scalable services while maintaining the appearance of a single directory to its users. The GDO for a persistent object system acts, passively, as a repository for information about the objects being maintained in the system. It also acts, actively, as a provider of management services on those same objects. Depending

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Th2 cytokines are associated with persistent hepatic fibrosis in human Schistosoma japonicum infection.

We conducted a prospective cohort study in Leyte, the Philippines, among 611 Schistosoma japonicum-infected participants 7-30 years old, all of whom were treated with praziquantel at baseline. To detect hepatic fibrosis, abdominal ultrasound was performed at baseline and 12 months after treatment. Stool for assessment of S. japonicum infection was collected at baseline and at 3, 6, 9, and 12 mo...

متن کامل

Automated Battery Swap and Recharge to Enable Persistent UAV Missions

This paper introduces a hardware platform for automated battery changing and charging for multiple UAV agents. The automated station holds a buffer of 8 batteries in a novel dual-drum structure that enables a “hot” battery swap, thus allowing the vehicle to remain powered on throughout the battery changing process. Each drum consists of four battery bays, each of which is connected to a smartch...

متن کامل

In lieu of swap: Analyzing compressed RAM in Mac OS X and Linux

The forensics community is increasingly embracing the use of memory analysis to enhance traditional storage-based forensics techniques, because memory analysis yields a wealth of information not available on non-volatile storage. Memory analysis involves capture of a system's physical memory so that the live state of a system can be investigated, including executing and terminated processes, ap...

متن کامل

Node Swap: A Universal Mechanism to Make P2P Overlay Topology-aware

P2P computing has emerged as a popular model for utilizing information and resource in Internet. It is built upon an overlay whose topology is independent of the underlying physical network. Because of the mismatch between the overlay and physical network, small number of logical hops may result in a long delay and excessive traffic. In this paper, we propose a universal mechanism-“node swap” t...

متن کامل

Correction of a Memory Management Method for Lock-Free Data Structures

Memory reuse in link-based lock-free data structures requires special care. Many lock-free algorithms require deleted nodes not to be reused until no active pointers point to them. Also, most lock-free algorithms use the compare and swap atomic primitive, which can suffer from the “ABA problem” [1] associated with memory reuse. Valois [3] proposed a memory management method for link-based data ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996